On the Reformulation of Nonlinear Complementarity Problems Using the Fischer-burmeister Function
نویسنده
چکیده
A bounded-level-set result for a reformulation of the box-constrained variational inequality problem proposed recently by Facchinei, Fischer and Kanzow is proved. An application of this result to the (unbounded) nonlinear complementarity problem is suggested.
منابع مشابه
Using exact penalties to derive a new equation reformulation of KKT systems associated to variational inequalities
In this paper, we present a new reformulation of the KKT system associated to a variational inequality as a semismooth equation. The reformulation is derived from the concept of differentiable exact penalties for nonlinear programming. The best results are presented for nonlinear complementarity problems, where simple, verifiable, conditions ensure that the penalty is exact. We also develop a s...
متن کاملA neural network based on the generalized Fischer-Burmeister function for nonlinear complementarity problems
In this paper, we consider a neural network model for solving the nonlinear complementarity problem (NCP). The neural network is derived from an equivalent unconstrained minimization reformulation of the NCP, which is based on the generalized Fischer–Burmeister function /pða; bÞ 1⁄4 kða; bÞkp ðaþ bÞ. We establish the existence and the convergence of the trajectory of the neural network, and stu...
متن کاملSolution of Nonsmooth Generalized Complementarity Problems
We consider an unconstrained minimization reformulation of the generalized complementarity problem GCP(f, g) when the underlying functions f and g are H-differentiable. We describe H-differentials of some GCP functions based on the min function and the penalized Fischer-Burmeister function, and their merit functions. Under appropriate semimonotone (E0), strictly semimonotone (E) regularity-cond...
متن کاملJacobian Smoothing Methods for General Nonlinear Complementarity Problems
We present a new algorithm for the solution of general (not necessarily monotone) complementarity problems. The algorithm is based on a reformulation of the complementar-ity problem as a nonsmooth system of equations by using the Fischer-Burmeister function. We use an idea by Chen, Qi and Sun and apply a Jacobian smoothing method (which is a mixture between nonsmooth Newton and smoothing method...
متن کاملOn Some NCP-Functions Based on the Generalized Fischer-burmeister Function
In this paper, we study several NCP-functions for the nonlinear complementarity problem (NCP) which are indeed based on the generalized Fischer-Burmeister function, φp(a, b) = ‖(a, b)‖p−(a+b). It is well known that the NCP can be reformulated as an equivalent unconstrained minimization by means of merit functions involving NCPfunctions. Thus, we aim to investigate some important properties of t...
متن کامل